blocking set造句

• Blocking sets which contained lines would be called " trivial " blocking sets.
• Blocking sets which contained lines would be called " trivial " blocking sets.
• It is sometimes useful to drop the condition that a blocking set does not contain a line.
• When " n " is not a square less can be said about the smallest sized nontrivial blocking sets.
• The linemen don't fire out but use a pass-blocking set to convince the defensive line it's a pass play.
• Under this extended definition, and since, in a projective plane every pair of lines meet, every line would be a blocking set.
• Any blocking set in a projective plane ? of order " n " has at least n + \ sqrt { n } + 1 points.
• Any minimal blocking set in a projective plane ? of order " n " has at most n \ sqrt { n } + 1 points.
• Objects of study include vector spaces, unitals, blocking sets, ovoids, caps, spreads and all finite analogues of structures found in non-finite geometries.
• Moreover, if this lower bound is met, then " n " is necessarily a square and the blocking set consists of the points in some Baer subplane of ?.
• Moreover, if this upper bound is reached, then " n " is necessarily a square and the blocking set consists of the points of some unital embedded in ?.
• As another example, let " C " consist of all the lines of a projective plane, then a blocking set in this plane is a set of points which intersects each line but contains no line.
• Another general construction in an arbitrary projective plane of order " n " is to take all except one point, say " P ", on a given line and then one point on each of the other lines through " P ", making sure that these points are not all collinear ( this last condition can not be satisfied if " n " = 2 . ) This produces a minimal blocking set of size 2 " n ".